Independent edge dominating set of certain graphs

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Parameterized Edge Dominating Set in Cubic Graphs

In this paper, we present an improved algorithm to decide whether a graph of maximum degree 3 has an edge dominating set of size k or not, which is based on enumerating vertex covers. We first enumerate vertex covers of size at most 2k and then construct an edge dominating set based on each vertex cover to find a satisfied edge dominating set. To enumerate vertex covers, we use a branch-and-red...

متن کامل

A Study on Edge-Set Graphs of Certain Graphs

LetG(V,E) simple connected graph, with |E| = . In this paper, we define an edge-set graph GG constructed from the graphG such that any vertex vs,i of GG corresponds to the i-th s-element subset ofE(G) and any two vertices vs,i, vk,m of GG are adjacent if and only if there is at least one edge in the edge-subset corresponding to vs,i which is adjacent to at least one edge in the edge-subset corr...

متن کامل

On Approximability of the Independent/Connected Edge Dominating Set Problems

We investigate polynomial-time approximability of the problems related to edge dominating sets of graphs. When edges are unit-weighted, the edge dominating set problem is polynomially equivalent to the minimum maximal matching problem, in either exact or approximate computation, and the former problem was recently found to be approximable within a factor of 2 even with arbitrary weights. It wil...

متن کامل

Edge-Dominating Set Problem

We study the approximability of the weighted edge-dominating set problem. Although even the unweighted case is NP-Complete, in this case a solution of size at most twice the minimum can be efficiently computed due to its close relationship with minimum maximal matching; however, in the weighted case such a nice relationship is not known to exist. In this paper, after showing that weighted edge ...

متن کامل

Exact Algorithms for Annotated Edge Dominating Set in Cubic Graphs

Given a graph G = (V,E) together with a nonnegative integer requirement on vertices r : V → Z+, the annotated edge dominating set problem is to find a minimum set M ⊆ E such that, each edge in E −M is adjacent to some edge in M , and M contains at least r(v) edges incident on each vertex v ∈ V . The annotated edge dominating set problem is a natural extension of the classical edge dominating se...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Mathematical Forum

سال: 2007

ISSN: 1314-7536

DOI: 10.12988/imf.2007.07029